Generative Modeling of Coordination by Factoring Parallelism and Selectional Preferences

نویسندگان

  • Daisuke Kawahara
  • Sadao Kurohashi
چکیده

We present a unified generative model of coordination that considers parallelism of conjuncts and selectional preferences. Parallelism of conjuncts, which frequently characterizes coordinate structures, is modeled as a synchronized generation process in the generative parser. Selectional preferences learned from a large web corpus provide an important clue for resolving the ambiguities of coordinate structures. Our experiments of Japanese dependency parsing indicate the effectiveness of our approach, particularly in the domains of newspapers and patents.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical models for the induction and use of selectional preferences

Selectional preferences have a long history in both generative and computational linguistics. However, 11 since the publication of Resnik’s dissertation in 1993, a new approach has surfaced in the computational 12 linguistics community. This new line of research combines knowledge represented in a pre-defined 13 semantic class hierarchy with statistical tools including information theory, stati...

متن کامل

Improving Statistical Machine Translation with Selectional Preferences

Long-distance semantic dependencies are crucial for lexical choice in statistical machine translation. In this paper, we study semantic dependencies between verbs and their arguments by modeling selectional preferences in the context of machine translation. We incorporate preferences that verbs impose on subjects and objects into translation. In addition, bilingual selectional preferences betwe...

متن کامل

Modeling Selectional Preferences of Verbs and Nouns in String-to-Tree Machine Translation

We address the problem of mistranslated predicate-argument structures in syntaxbased machine translation. This paper explores whether knowledge about semantic affinities between the target predicates and their argument fillers is useful for translating ambiguous predicates and arguments. We propose a selectional preference feature based on the selectional association measure of Resnik (1996) an...

متن کامل

Three New Probabilistic Models for Dependency Parsing: An Exploration

After presenting a novel O(n) parsing algorithm for dependency grammar, we develop three contrasting ways to stochasticize it. We propose (a) a lexical affinity model where words struggle to modify each other, (b) a sense tagging model where words fluctuate randomly in their selectional preferences, and (c) a generative model where the speaker fleshes out each word’s syntactic and conceptual st...

متن کامل

Dgfs-cl Comparing Computational Models of Selectional Preferences – Second-order Co-occurrence vs. Latent Semantic Clusters

Selectional preferences (i.e., semantic restrictions on the realisation of predicate complements) are of great interest to research in Computational Linguistics, both from a lexicographic and from an applied (wrt data sparseness) perspective. This poster presents a comparison of three computational approaches to selectional preferences: (i) an intuitive distributional approach that uses second-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011